The graph sandwich problem for 1-join composition is NP-complete
نویسندگان
چکیده
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR ; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no vertex of SL is adjacent to vertex of AR∪SR; no vertex of SR is adjacent to a vertex of AL∪SL. The graph sandwich problem for 1-join composition is de9ned as follows: Given a vertex set V , a forced edge set E, and a forbidden edge set E, is there a graph G=(V; E) such that E ⊆ E and E ∩ E = ∅, which is a 1-join composition graph? We prove that the graph sandwich problem for 1-join composition is NP-complete. This result stands in contrast to the case where SL = ∅ (SR = ∅), namely, the graph sandwich problem for homogeneous set, which has a polynomial-time solution. ? 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Cograph-(k, `) Graph Sandwich Problem
A cograph is a graph without induced P4 (where P4 denotes an induced path with 4 vertices). A graph G is (k, `) if its vertex set can be partitioned into at most k independent sets and ` cliques. Threshold graphs are cographs-(1, 1). Cographs-(2, 1) are a generalization of threshold graphs and, as threshold graphs, they can be recognized in linear time. GRAPH SANDWICH PROBLEMS FOR PROPERTY Π (Π...
متن کاملOn the Complexity of (k, l)-Graph Sandwich Problems
In 1995 Golumbic, Kaplan and Shamir defined graph sandwich problems as follows: graph sandwich problem for property Π (Π-sp) Input: Two graphs G = (V,E) and G = (V,E) such that E ⊆ E. Question: Is there a graph G = (V,E) satisfying the property Π such that E ⊆ E ⊆ E? The graphG is called sandwich graph for the pair (G, G). Note that making E = E = E we have the recognition problem for the prope...
متن کاملThe chain graph sandwich problem
The chain graph sandwich problem asks: Given a vertex set V , a mandatory edge set E1, and a larger edge set E2, is there a graph G= (V ,E) such that E1 ⊆ E ⊆ E2 with G being a chain graph (i.e., a 2K2-free bipartite graph)? We prove that the chain graph sandwich problem is NP-complete. This result stands in contrast to (1) the case where E1 is a connected graph, which has a linear-time solutio...
متن کاملOn the forbidden induced subgraph sandwich problem
Weconsider the sandwich problem, a generalization of the recognition problem introduced by Golumbic et al. (1995) [15], with respect to classes of graphs defined by excluding induced subgraphs. We prove that the sandwich problem corresponding to excluding a chordless cycle of fixed length k is NP-complete. We prove that the sandwich problem corresponding to excluding Kr \ e for fixed r is polyn...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 5 شماره
صفحات -
تاریخ انتشار 2000